The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
f(0) → s(0)
f(s(x)) → minus(s(x), g(f(x)))
g(0) → 0
g(s(x)) → minus(s(x), f(g(x)))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
minus(s(x), s(y)) →⁺ minus(x, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x), y / s(y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
minus, f, g

They will be analysed ascendingly in the following order:
minus < f
minus < g
f = g

(8) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
minus, f, g

They will be analysed ascendingly in the following order:
minus < f
minus < g
f = g

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

Induction Base:
minus(gen_0':s2_0(0), gen_0':s2_0(0)) →_R^Ω(1)
gen_0':s2_0(0)

Induction Step:
minus(gen_0':s2_0(+(n4_0, 1)), gen_0':s2_0(+(n4_0, 1))) →_R^Ω(1)
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) →_IH
gen_0':s2_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
g, f

They will be analysed ascendingly in the following order:
f = g

(12) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
g(gen_0':s2_0(+(1, n228_0))) → *3_0, rt ∈ Ω(n228₀)

Induction Base:
g(gen_0':s2_0(+(1, 0)))

Induction Step:
g(gen_0':s2_0(+(1, +(n228_0, 1)))) →_R^Ω(1)
minus(s(gen_0':s2_0(+(1, n228_0))), f(g(gen_0':s2_0(+(1, n228_0))))) →_IH
minus(s(gen_0':s2_0(+(1, n228_0))), f(*3_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(13) Complex Obligation (BEST)

(14) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_0':s2_0(+(1, n228_0))) → *3_0, rt ∈ Ω(n228₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
f

They will be analysed ascendingly in the following order:
f = g

(15) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
f(gen_0':s2_0(+(1, n4065_0))) → *3_0, rt ∈ Ω(n4065₀)

Induction Base:
f(gen_0':s2_0(+(1, 0)))

Induction Step:
f(gen_0':s2_0(+(1, +(n4065_0, 1)))) →_R^Ω(1)
minus(s(gen_0':s2_0(+(1, n4065_0))), g(f(gen_0':s2_0(+(1, n4065_0))))) →_IH
minus(s(gen_0':s2_0(+(1, n4065_0))), g(*3_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(16) Complex Obligation (BEST)

(17) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_0':s2_0(+(1, n228_0))) → *3_0, rt ∈ Ω(n228₀)
f(gen_0':s2_0(+(1, n4065_0))) → *3_0, rt ∈ Ω(n4065₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
g

They will be analysed ascendingly in the following order:
f = g

(18) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
g(gen_0':s2_0(+(1, n64234_0))) → *3_0, rt ∈ Ω(n64234₀)

Induction Base:
g(gen_0':s2_0(+(1, 0)))

Induction Step:
g(gen_0':s2_0(+(1, +(n64234_0, 1)))) →_R^Ω(1)
minus(s(gen_0':s2_0(+(1, n64234_0))), f(g(gen_0':s2_0(+(1, n64234_0))))) →_IH
minus(s(gen_0':s2_0(+(1, n64234_0))), f(*3_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(19) Complex Obligation (BEST)

(20) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_0':s2_0(+(1, n64234_0))) → *3_0, rt ∈ Ω(n64234₀)
f(gen_0':s2_0(+(1, n4065_0))) → *3_0, rt ∈ Ω(n4065₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(22) BOUNDS(n^1, INF)

(23) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_0':s2_0(+(1, n64234_0))) → *3_0, rt ∈ Ω(n64234₀)
f(gen_0':s2_0(+(1, n4065_0))) → *3_0, rt ∈ Ω(n4065₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(24) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(25) BOUNDS(n^1, INF)

(26) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_0':s2_0(+(1, n228_0))) → *3_0, rt ∈ Ω(n228₀)
f(gen_0':s2_0(+(1, n4065_0))) → *3_0, rt ∈ Ω(n4065₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(27) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(28) BOUNDS(n^1, INF)

(29) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_0':s2_0(+(1, n228_0))) → *3_0, rt ∈ Ω(n228₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(30) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(31) BOUNDS(n^1, INF)

(32) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
f(0') → s(0')
f(s(x)) → minus(s(x), g(f(x)))
g(0') → 0'
g(s(x)) → minus(s(x), f(g(x)))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
f :: 0':s → 0':s
g :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(33) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(34) BOUNDS(n^1, INF)